Group percolation in interdependent networks
نویسندگان
چکیده
Zexun Wang, 2, ∗ Dong Zhou, ∗ and Yanqing Hu 4, † School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510006, China Big Data Research Center,University of Electronic Science and Technology of China, Chengdu 611731, China Simula Research Laboratory, 1325 Lysaker, Norway Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 611731, China (Dated: January 3, 2018)
منابع مشابه
The robustness of interdependent clustered networks
It was recently found that cascading failures can cause the abrupt breakdown of a system of interdependent networks. Using the percolation method developed for single clustered networks by Newman [Phys. Rev. Lett. 103, 058701 (2009)], we develop an analytical method for studying how clustering within the networks of a system of interdependent networks affects the system’s robustness. We find th...
متن کاملPercolation in real interdependent networks
The function of a real network depends not only on the reliability of its own components, but is a ected also by the simultaneous operation of other real networks coupled with it. Whereas theoretical methods of direct applicability to real isolated networks exist, the frameworks developed so far in percolation theory for interdependent network layers are of little help in practical contexts, as...
متن کاملThe effect of interdependence on the percolation of interdependent networks
Two stochastic models are proposed to generate a system composed of two interdependent scale-free (SF) or Erdős-Rényi (ER) networks where interdependent nodes are connected with exponential or power-law relation, as well as different dependence strength, respectively. Each subnetwork grows through the addition of new nodes with constant accelerating random attachment in the first model but with...
متن کاملThe effect of randomness for dependency map on the robustness of interdependent lattices
The percolation for interdependent networks with identical dependency map follows a second-order phase transition which is exactly the same with percolation on a single network, while percolation for random dependency follows a first-order phase transition. In real networks, the dependency relations between networks are neither identical nor completely random. Thus in this paper, we study the i...
متن کاملA Simplified Self-Consistent Probabilities Framework to Characterize Percolation Phenomena on Interdependent Networks : An Overview
Abstract Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the percolation phenomena of these systems, different mathematical frameworks have been proposed including generating functions, eigenvalues among some others. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.00665 شماره
صفحات -
تاریخ انتشار 2018